The weak-heap data structure: Variants and applications
نویسندگان
چکیده
منابع مشابه
The weak-heap data structure: Variants and applications
The weak heap is a priority queue that was introduced as a competitive structure for sorting. Its array-based form supports the operations find -min in O(1) worst-case time, and insert and delete-min in O(lg n) worst-case time using at most dlg ne element comparisons. Additionally, its pointer-based form supports delete and decrease in O(lg n) worst-case time using at most dlg ne element compar...
متن کاملthe underlying structure of language proficiency and the proficiency level
هدف از انجام این تخقیق بررسی رابطه احتمالی بین سطح مهارت زبان خارجی (foreign language proficiency) و ساختار مهارت زبان خارجی بود. تعداد 314 زبان آموز مونث و مذکر که عمدتا دانشجویان رشته های زبان انگلیسی در سطوح کارشناسی و کارشناسی ارشد بودند در این تحقیق شرکت کردند. از لحاظ سطح مهارت زبان خارجی شرکت کنندگان بسیار با هم متفاوت بودند، (75 نفر سطح پیشرفته، 113 نفر سطح متوسط، 126 سطح مقدماتی). کلا ...
15 صفحه اولVariants of Mixtures: Information Properties and Applications
In recent years, we have studied information properties of various types of mixtures of probability distributions and introduced a new type, which includes previously known mixtures as special cases. These studies are disseminated in different fields: reliability engineering, econometrics, operations research, probability, the information theory, and data mining. This paper presents a holistic ...
متن کاملStability Analysis and Stabilization of Miduk Heap Leaching Structure, Iran
To construct copper heap leaching structures, a stepped heap of ore is placed over an isolated sloping surface and then washed with sulphuric acid. The isolated bed of such a heap consists of some natural and geosynthetic layers. Shear strength parameters between these layers are low, so they form the possible sliding surfaces of the heaps. Economic and environmental considerations call for stu...
متن کاملHeap – ternary algebraic structure ∗
In this paper some classes of ternary algebraic structures (semi-heaps, heaps) are considered. The connection between heaps (laterally commutative heaps) and corresponding algebraic and geometric structures is presented. The equivalence of heap existence and the Desargues system on the same set is directly proved. It is the starting point for an analogous result about a laterally commutative he...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2012
ISSN: 1570-8667
DOI: 10.1016/j.jda.2012.04.010